Equitable block colourings for 8-cycle systems

نویسندگان

  • Paola Bonacini
  • Lucia Marino
چکیده

Let Σ = (X,B) be an 8-cycle system of order v = 1+16k. A c-colouring of type s is a map φ : B → C, with C set of colours, so that exactly c colours are used and for every vertex x all the blocks containing x are coloured with exactly s colours. Let 8k = qs+ r, with q, r ≥ 0. The colouring φ is called equitable if for every vertex x the set of the 8k blocks containing x is partitioned into r colour classes of cardinality q + 1 and s− r colour classes of cardinality q. This paper deals with a study of bicolourings, tricolourings and quadricolourings with s = 2, 3, 4.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Equitable Block Colourings for Systems of 4-Kites

An equitable colouring of a balanced G-design (X,B) is a map φ∶B → C such that ∣bi(x) − bj(x)∣ ≤ 1 for any x ∈ X and i, j, with i ≠ j, being bi(x) the number of blocks containing the vertex x and coloured with the colour i. A c-colouring is a colouring in which exactly c colours are used. A c-colouring of type s is a colourings in which, for every vertex x, all the blocks containing x are colou...

متن کامل

Equitable colourings in the Witt designs

There is a vast literature already in existence on colourings in graphs and designs. We refer the interested reader to [2, 7, 8, 11, 12]. A major application of such colourings is to sampling and scheduling problems. For an excellent consideration of designs for statistical purposes, see [13]; in [8], examples of graph colouring applications in scheduling are described. Let P be a point set and...

متن کامل

2 PAOLA BONACINI AND LUCIA MARINO The

Let Σ = (X,B) a 4-cycle system of order v = 1 + 8k. A c-colouring of type s is a map φ∶ B → C, with C set of colours, such that exactly c colours are used and for every vertex x all the blocks containing x are coloured exactly with s colours. Let 4k = qs+r, with q, r ≥ 0. φ is equitable if for every vertex x the set of the 4k blocks containing x is parted in r colour classes of cardinality q + ...

متن کامل

On some colouring of 4-cycle systems with specified block colour patterns

The present paper continues the study (begun by Quattrocchi, Colouring 4-cycle systems with specified block colour pattern: the case of embedding P3-designs, Electron. J. Combin., 8 (2001)) of 4-cycle systems with specified block colour patterns that are also strict colourings in the sense of Voloshin (Coloring Mixed Hypergraphs: Theory, Algorithms and Applications, American Mathematical Societ...

متن کامل

Equitable Colourings Of D-Degenerate Graphs

In many applications of graph colouring the sizes of colour classes should not be too large. For example, in scheduling jobs (some of which could be performed at the same time), it is not good if the resulting schedule requires many jobs to occur at some specific time. An application of this type is discussed in [8]. A possible formalization of this restriction is the notion of equitable colour...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017